Pseudo 0.6h WinBoard by Jan Klima,CZ
irenicus@volny.cz

characteristics:
-0x88 board representation
-principal variation search(fail soft)
-null move pruning R=3, generates checks in qsearch after null move
-internal iterative deepening
-experimental implementation of futility pruning,lazy evaluation...
-generates attack tables at every evaluation call, although it's far from using their full potential
-SEE qsearch pruning and SEE-directed ordering of captures

known problems&bugs:
-weak and horribly untuned evaluation during whole game, no special endgame knowledge except kpk(and that may not work because of lazy eval or futility pruning, i've done no testing yet)
-obvious bugs in search,weird search instability,moves that did lose the game sometimes(often) cannot be reproduced in console test, this is probably the major problem now
-only basic time control
-'analyze' mode may not work properly in all positions, it will work however perfectly with 'epd2wb' by Bruce Moreland



many thanks to:
-Robert Hyatt, Crafty source is nice to see(SEE) "what-is-this-all-about"
-Bruce Moreland, his pages are really outstanding for beginners
-Filip Tvrzsky, for all his replies to my dumb questions
-Ed Schroder, for many great advanced ideas published on his web
-Fabien Letouzey, his open source program Fruit proved to be excellent partner for many test games, it also inspired me how to write simple drawish endgame and candidate passer evaluation
-all other chess programmers, whose engines I used in tournaments to test every new build
-Colin Frayn and Dann Corbit, I stole their Beowulf's opening book without asking :(

-and of course to all other people from CCC forum

version info:

0.6g->0.6h:
-fixed(i hope so) cases when engine lost on time and crashed
-recapture extension added(1/2 ply)
-changed futility pruning, now it's more safe(and maybe it gives no speedup at all):) current search setting improved performance in some tactital test suites
-in this version nodes are counted in a different manner(nodes=number of MakeMove calls... position after making a null move is not counted as a new node)
-some minor eval tweaks
-this is probably the last 0.6 version(unless there are some bad bugs there)....
 goals of 0.7:
 -time control+pondering
 -speed optimization, till this moment i wrote the program to be easy to read and modify,speedup of at least 15-20% should be easy to obtain
 -improved search stability
 -much better evaluation:)
...but i don't have enough free time now and with 1 or 2 hours/week this will take ages:)

0.6f->0.6g:
-bug that might cause problems(crashes) in KX-K positions fixed
-possible i/o bugs fixed


0.6->0.6f:
-mate threat extension fixed
-fifty moves rule fix
-book fix
-lazy eval modified(less nps probably)
-now writing to only one log file, which is deleted when program starts:)
-some minor eval fixes
-safe handling of mate scores(temporary)
